Game tree algorithms and solution trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game Tree Algorithms and Solution Trees

In this paper a theory of game tree algorithms is presented, entirely based upon the concept of a solution tree. Two types of solution trees are distinguished: max and min trees. Every game tree algorithm tries to prune as many nodes as possible from the game tree. A cut-off criterion in terms of solution trees will be formulated, which can be used to eliminate nodes from the search without aff...

متن کامل

Solution Trees as a Basis for Game-Tree Search

A game tree algorithm is an algorithm computing the minimax value of the root of a game tree. Many algorithms use the notion of establishing proofs that this value lies above or below some boundary value. We show that this amounts to the construction of a solution tree. We discuss the role of solution trees and critical trees in the following algorithms: Principal Variation Search, alpha-beta, ...

متن کامل

A Theory of Game Trees, Based on Solution Trees

In this paper, a theory of game tree algorithms is presented, entirely based upon the concept of solution tree. Two types of solution trees are distinguished: max and min solution trees respectively. We show that a game tree algorithm actually constructs a superposition of a max and a min solution tree. For algorithms searching a game tree, a cutoo criterion is suitable. A cut-oo criterion in t...

متن کامل

A framework for game tree algorithms

A unifying framework for game tree algorithms is GSEARCH, designed by Ibaraki Ibaraki 86]. In general, a relatively great deal of memory is necessary for instances of this framework. In Ibaraki 91A] an extended framework, called RSEARCH, is discussed, in which the use of memory can be controlled. In this paper variants of above frameworks are introduced, to be called Gsearch and Rsearch respect...

متن کامل

Optimal Parametric Search Algorithms in Trees I: Tree Partitioning

Linear-time algorithms are presented for partitioning a tree with weights on the vertices by removing k edges so as to either minimize the maximum weight component or maximize the minimum-weight component.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2001

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(00)00082-7